Differentiated Services with Lottery Queueing
نویسندگان
چکیده
This work investigates the benefits and drawbacks of using a lottery to schedule and drop packets within a router. We find that a lottery can provide many distinct levels of service without requiring that per-flow state be maintained in the routers. We also investigate the re-ordering within a flow that can occur if a lottery is used to pick packets to forward without regard to their flow order.
منابع مشابه
A Generalizable Service Architecture for Mobile Networks
In response to the increasing demands for mobile communications and differentiated network services, we present a novel and generalizable service architecture that supports multiple service classes in wireless networks with mobile hosts. This architecture, called Lottery-Based Multiple Access (LBMA), is based on the abstraction of a lottery, in which hosts hold lottery tickets that represent a ...
متن کاملSimulation-Based Performance Comparison of Queueing Disciplines for Differentiated Services Using OPNET
Queueing disciplines have been a subject of intensive discussion and research in the network field for scheduling packets from different traffic flows for processing at a network node (switch or router). Several queue scheduling disciplines have been designed to improve the quality of service for networked multimedia applications. In this paper, we evaluate the performance of four queueing disc...
متن کاملAssurance of Video Conference Services with Combination of Weighted Fair Queueing Scheduling Discipline and Low Latency Queue
The need for improved network traffic and bandwidth management becomes more and more urgent as real time applications begin to coexist within current shared infrastructure. Recent developments within the research community and within commercial products provide numerous technologies that may be applied as solutions. The most popular are Differentiated Services (DiffServ) with numerous different...
متن کاملEfficient implementation of relative differentiated services using proportional probabilistic priority
This paper studies the design and performance of the Probabilistic Priority (PP) [5] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [10] to bandwidth allocation in a strict priority s...
متن کاملAchieving Relative Differentiated Services Using Proportional Probabilistic Priority Scheduling on Network Processor
This paper studies the design and performance of the Probabilistic Priority (PP) packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP is a special scheme of applying lottery scheduling to bandwidth allocation in a strict priority sense. We then propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001